Deterministic vs non-deterministic graph property testing
نویسندگان
چکیده
منابع مشابه
Deterministic vs Non-deterministic Graph Property Testing
A graph property P is said to be testable if one can check whether a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a “certificate” to the fact that a graph satisfies P so that once the certificate is given its correctness can be tested. The notion of non-deterministic testing of graph propert...
متن کاملNon-Deterministic Graph Property Testing
A property of finite graphs is called nondeterministically testable if it has a “certificate” such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificatees that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that nondeterministi...
متن کاملStochastic Refusal Graph for Testing Non-Deterministic Systems
The test is one of the approaches commonly used for validating systems to ensure qualitative and quantitative implementation requirements. In this paper we are interested in refusals test based for testing stochastic systems. We propose a new kind of refusals graph named stochastic refusals graphs (SRG) for specification in maximality-based stochastic labeled transition systems (MSLTS) model. I...
متن کاملUnsupervised learning of link specifications: deterministic vs. non-deterministic
Link Discovery has been shown to be of utter importance for the Linked Data Web. In previous works, several supervised approaches have been developed for learning link specifications out of labelled data. Most recently, genetic programming has also been utilized to learn link specifications in an unsupervised fashion by optimizing a parametrized pseudo-F-measure. The questions underlying this e...
متن کاملNon-deterministic Lazy It -calculus Vs It -caculus Non-deterministic Lazy -calculus Vs -calculus
We pursue the study of the embedding of the-calculus into the-calculus. Various lambda calculi with parallel and convergence testing facilities are examined and their expressiveness compared; j-a lazy calculus augmented with a non-deterministic choice operator and a convergence testing combinator, emerges as a suitable language to be encoded in. Through the use of closures for variables and abs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2014
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-014-1096-x